Suspension Optimization and In-place Updates for Optimizing CHR Compilation
نویسندگان
چکیده
We introduce two CHR compiler optimizations aimed at reducing garbage creation by reusing suspension terms, used to represent the CHR constraints. We have implemented both optimizations in the K.U.Leuven CHR system. The optimizations dramatically improve the memory footprint and speed of CHR programs: in several benchmarks we have measured speedups of 40% and more, and a reduction of memory usage by a factor of four.
منابع مشابه
Comparative Research on Optimal Damping Matching of Seat System for an off-Highway Dump Truck
To protect the driver of off-highway dump trucks from the harmful vibration, this paper presents the comparison results to determine the optimal damping of the seat system by different optimization design plans. Three optimization schemes are considered including individually optimizing the damping of the cushion, individually optimizing the damping of the seat suspension, and integrately optim...
متن کاملBI-OBJECTIVE OPTIMIZATION OF RESERVOIR OPERATION BY MULTI-STEP PARALLEL CELLULAR AUTOMATA
Parallel Cellular Automata (PCA) previously has been employed for optimizing bi-objective reservoir operation, where one release is used to meet both objectives. However, if a single release can only be used for one objective, meaning two separate sets of releases are needed, the method is not applicable anymore. In this paper, Multi-Step Parallel Cellular Automata (MSPCA) has been developed fo...
متن کاملPlace Finding and Optimizing the Determination of Production Units Dynamically for Providing the Electricity and Heat in Industrial City
In this article the place and capacity of combined heat and power [CHP] prediction unit wasdetermined dynamically with use of modified particle swarm optimization (MPSO). It was done inoptimization palace and with a capacity of CHP as a production resource with the aim to increasethe reliability capacity. Decrease the loss and provide the electrical and thermal energies ofindustrial city. The f...
متن کاملCompilation and Simpliication of Temporal Integrity Constraints
The paper presents a novel compilation scheme for temporal integrity constraints and deductive rules expressed in an interval-based rst-order temporal logic. Compilation builds a dependence graph with simpliied forms of the constraints and rules. This permits the compile-time simpliication of the formulae that have to be veriied at run-time, as well as the precomputation of potential implicit u...
متن کاملAnalysis and Optimization of CHR Programs
Introduction. Constraint Handling Rules (CHR) [2] is a high-level, powerful, yet relatively simple “no box” CLP language, embedded in a host language, commonly Prolog. It is based on multi-headed committed-choice rules. Recent implementations of CHR consist of a compiler which translates a CHR program to host language code, and a run-time system implementing the constraint store. Originally, CH...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005